#include <vector>
#include <algorithm>
using namespace std;
class Solution
{
public:
    vector<vector<int>> merge(vector<vector<int>> &intervals)
    {
        bool flag = true;
        if (intervals.size() == 0)
        {
            return intervals;
        }
        if (intervals.size() == 1)
        {
            return intervals;
        }
        sort(intervals.begin(), intervals.end());
      for(int i = 0;i<intervals.size()-1;i++){
          if(intervals[i][1]>intervals[i+1][0]){
              //说明有重合
              
          }
      }
    }
};